#include "pch.h"

#include "bintree.hpp"

template<typename T, typename U, typename func = std::less<>>
bool f(T v, U u)
{
  func(v, u);
}

TEST(BinTreeTest, InAndPostOrderCreateTest)
{
  BinTree<int> tree;
  //tree.preAndInOrderCreate({ 10, 5, 7, 2, 3, 4, 9 }, {});
  //  5
  //9   67
  //  32
  auto root = tree.inAndPostOrderCreate({ 9, 5, 32, 67 }, { 9, 32, 67, 5 });
  assert(root->data == 5);
  tree.travPre(std::cout); // 5 9 67 32
  ASSERT_EQ(1, 1);
}